Direct and inverse discrete Zernike transform.
نویسندگان
چکیده
An invertible discrete Zernike transform, DZT is proposed and implemented. Three types of non-redundant samplings, random, hybrid (perturbed deterministic) and deterministic (spiral) are shown to provide completeness of the resulting sampled Zernike polynomial expansion. When completeness is guaranteed, then we can obtain an orthonormal basis, and hence the inversion only requires transposition of the matrix formed by the basis vectors (modes). The discrete Zernike modes are given for different sampling patterns and number of samples. The DZT has been implemented showing better performance, numerical stability and robustness than the standard Zernike expansion in numerical simulations. Non-redundant (critical) sampling along with an invertible transformation can be useful in a wide variety of applications.
منابع مشابه
Geometrically Invariant Image Watermarking Based on Feature Extraction and Zernike Transform
A robust and geometric invariant digital image watermarking scheme based on feature extraction and local Zernike transform is proposed in this paper. The Adaptive Harris Detector is proposed to extract feature patches for watermarking use. A local Zernike moments-based watermarking scheme is raised, where the watermarked patches can be obtained directly by inverse Zernike Transform. Each extrac...
متن کاملInvariant Image Watermarking Using Harris Feature Extraction and Zernike Moments
A robust and geometric invariant digital image watermarking scheme based on feature extraction and local Zernike transform is proposed in this paper. The Adaptive Harris Detector is proposed to extract feature patches for watermarking use. A local Zernike moments-based watermarking scheme is raised, where the watermarked patches can be obtained directly by inverse Zernike Transform. Each extrac...
متن کاملNumerical Solution of Volterra-Fredholm Integral Equations with The Help of Inverse and Direct Discrete Fuzzy Transforms and Collocation Technique
متن کامل
Computing Zernike polynomials of arbitrary degree using the discrete Fourier transform
The conventional representation of Zernike polynomials Rn (ρ) gives unacceptable numerical results for large values of the degree n. We present an algorithm for the computation of Zernike polynomials of arbitrary degree n. The algorithm has the form of a discrete Fourier (cosine) transform which comes with advantages over other methods in terms of computation time, accuracy and ease of implemen...
متن کاملBessel-zernike discrete variable representation basis.
The connection between the Bessel discrete variable basis expansion and a specific form of an orthogonal set of Jacobi polynomials is demonstrated. These so-called Zernike polynomials provide alternative series expansions of suitable functions over the unit interval. Expressing a Bessel function in a Zernike expansion provides a straightforward method of generating series identities. Furthermor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Optics express
دوره 17 26 شماره
صفحات -
تاریخ انتشار 2009